Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound
نویسنده
چکیده
We give an algorithm for constructing linear network error-correcting codes that achieve the Singleton bound for network error-correcting codes. The proposed algorithm is based on the algorithm by Jaggi et al. We also clarify the relationship between the robust network coding and the network error-correcting codes with known locations of errors.
منابع مشابه
Pure Asymmetric Quantum MDS Codes from CSS Construction: A Complete Characterization
Using the Calderbank Shor Steane (CSS) construction, pure q-ary asymmetric quantum error-correcting codes attaining the quantum Singleton bound are constructed. Such codes are called pure CSS asymmetric quantum maximum distance separable (AQMDS) codes. Assuming the validity of the classical maximum distance separable (MDS) Conjecture, pure CSS AQMDS codes of all possible parameters are accounte...
متن کاملError Correcting Codes: Combinatorics, Algorithms and Applications 1 Strongly Explicit Construction
In the last lecture, we introduced code concatenation, where we compose an outer code Cout with an inner code Cin. We derived the Zyablov bound by picking Cout on the Singleton bound and Cin on the GV bound. We also presented a polynomial time construction of a code that achieves the Zyablov bound (and hence, an asymptotically good code). A somewhat unsatisfactory aspect of this construction wa...
متن کاملQuantum error-correcting codes associated with graphs
We present a construction scheme for quantum error correcting codes. The basic ingredients are a graph and a finite abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors. This allows a simple verification of the 1-error correcting property of fivefold codes in any...
متن کاملConstruction of [[n,n − 4,3]]q quantum codes for odd prime power q
The theory of quantum error-correcting codes (QECCs, for short) has been exhaustively studied in the literature; see [1–8]. The most widely studied class of quantum codes are binary quantum stabilizer codes. A thorough discussion on the principles of quantum coding theory was given in [3] and [4] for binary quantum stabilizer codes. An appealing aspect of binary quantum codes is that there exis...
متن کاملNetwork Coding, Algebraic Coding, and Network Error Correction
This paper discusses the relation between network coding, (classical) algebraic coding, and network error correction. In the first part, we clarify the relation between network coding and algebraic coding. By showing that the Singleton bound in algebraic coding theory is a special case of the Maxflow Min-cut bound in network coding theory, we formally establish that linear multicast and its str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 90-A شماره
صفحات -
تاریخ انتشار 2007